Genetic Algorithms for Word Problems in Partially Commutative Groups
نویسنده
چکیده
We describe an implementation of a genetic algorithm on partially commutative groups and apply it to the double coset search problem on a subclass of groups. This transforms a combinatorial group theory problem to a problem of combinatorial optimisation. We obtain a method applicable to a wide range of problems and give results which indicate good behaviour of the genetic algorithm, hinting at the presence of a new deterministic solution and a framework for further results.
منابع مشابه
Solutions of Word Equations Over Partially Commutative Structures
We give NSPACE(n logn) algorithms solving the following decision problems.Satisfiability: Is the given equation over a free partially commutative monoid with involution(resp. a free partially commutative group) solvable? Finiteness: Are there only finitely manysolutions of such an equation? PSPACE algorithms with worse complexities for the first problemare known, but so far, a P...
متن کاملPublic Key Cryptosystems Based on Free Partially Commutative Monoids and Groups
At INDOCRYPT 2003 Abisha, Thomas, and Subramanian proposed two public key schemes based on word problems in free partially commutative monoids and groups. We show that both proposals are vulnerable to chosen ciphertext attacks, and thus in the present form must be considered as insecure.
متن کاملPartially Commutative Inverse Monoids
Free partially commutative inverse monoids are investigated. Analogously to free partially commutative monoids (trace monoids), free partially commutative inverse monoids are the quotients of free inverse monoids modulo a partially defined commutation relation on the generators. A quasi linear time algorithm for the word problem is presented, more precisely, we give an O(n log(n)) algorithm for...
متن کاملA New Approach to Solve N-Queen Problem with Parallel Genetic Algorithm
Over the past few decades great efforts were made to solve uncertain hybrid optimization problems. The n-Queen problem is one of such problems that many solutions have been proposed for. The traditional methods to solve this problem are exponential in terms of runtime and are not acceptable in terms of space and memory complexity. In this study, parallel genetic algorithms are proposed to solve...
متن کاملTwo Recognizable String-Matching Problems Over Free Partially Commutative Monoids
Let C be a finite alphabet, and C* the free monoid generated by Z. Let x, y E C* and x = uyv for U, v E C*. Then y is a factor of x. Moreover if u = 1, then y is a prefix of x, and if u = 1, then y is a suffix of x. Here 2. is the null word. One of the typical string matching problems over C* is the following: given a text string XEX* and a pattern string VEC*, decide whether or not y is a fact...
متن کامل